Lenstra–Lenstra–Lovász lattice basis reduction algorithm

Results: 35



#Item
21Fast Lattice Point Enumeration with Minimal Overhead∗ Daniele Micciancio UCSD [removed]  Michael Walter

Fast Lattice Point Enumeration with Minimal Overhead∗ Daniele Micciancio UCSD [removed] Michael Walter

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-08-07 13:48:08
22Lattice Attacks on Digital Signature Schemes N.A. Howgrave-Graham, N.P. Smart MCS Department HPL Laboratories Bristol HPL[removed]

Lattice Attacks on Digital Signature Schemes N.A. Howgrave-Graham, N.P. Smart MCS Department HPL Laboratories Bristol HPL[removed]

Add to Reading List

Source URL: www.hpl.hp.com

Language: English - Date: 1999-09-08 19:15:27
23Cryptanalysis of NTRU with two public keys Abderrahmane Nitaj Laboratoire de Math´ematiques Nicolas Oresme Universit´e de Caen, France Email: [removed]

Cryptanalysis of NTRU with two public keys Abderrahmane Nitaj Laboratoire de Math´ematiques Nicolas Oresme Universit´e de Caen, France Email: [removed]

Add to Reading List

Source URL: www.math.unicaen.fr

Language: English - Date: 2011-09-02 16:54:04
24Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia

Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2002-01-22 06:23:32
25PSEUDO–CODE FOR THE MLLL ALGORITHM ∗ † Keith Matthews The following pseudo–code is extracted from the CALC source file lll.c (available at http://www.numbertheory.org/calc/krm_calc.html) for

PSEUDO–CODE FOR THE MLLL ALGORITHM ∗ † Keith Matthews The following pseudo–code is extracted from the CALC source file lll.c (available at http://www.numbertheory.org/calc/krm_calc.html) for

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2011-09-25 12:09:55
26(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1

(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1

Add to Reading List

Source URL: www.numbertheory.org

Language: English - Date: 2011-09-25 12:54:28
27!

! " # $ " # %# &%# " " # %#

Add to Reading List

Source URL: www.signelec.com

Language: English - Date: 2010-02-23 06:23:32
28C:/Documents and Settings/Samantha.bibi/Desktop/My Dropbox/LTSC[removed]jucs_sample_paper_latex.dvi

C:/Documents and Settings/Samantha.bibi/Desktop/My Dropbox/LTSC[removed]jucs_sample_paper_latex.dvi

Add to Reading List

Source URL: www.dline.info

Language: English - Date: 2013-02-22 08:00:42
29The complexity of factoring univariate polynomials over the rationals Mark van Hoeij

The complexity of factoring univariate polynomials over the rationals Mark van Hoeij

Add to Reading List

Source URL: www.math.fsu.edu

Language: English - Date: 2013-06-24 23:44:33
30  Kobe  University Repository : Kernel

  Kobe University Repository : Kernel

Add to Reading List

Source URL: www.lib.kobe-u.ac.jp

Language: English